Abstract:

In wireless multiple access relay networks, network coded relay can help two users transmit messages in the same time frequency resource without interference. Base station recovers the origin messages utilizing joint detection, and the achievable rate increases. In multiplerelay scenario, proper relay selection methods can further improve the overall throughput. Since relay selection is a complex optimization problem, to reduce the complexity, the network is modeled as a weighted bipartite graph and relay selection problem turns into the maximum weight matching problem. The Kuhn and Munkres (KM) algorithm and the greedy algorithm are utilized to solve the relay selection for multiaccess network, and Monte Carlo. Simulations show that the KM algorithm achieves a bit higher ergodic capacity than that of greedy algorithm. 

Key words: network coding, relay selection, maximum weight matching